Automata Iteration

نویسندگان

  • François Cantin
  • Axel Legay
  • Pierre Wolper
چکیده

This paper considers the problem of computing the real convex hull of a finite set of ndimensional integer vectors. The starting point is a finite-automaton representation of the initial set of vectors. The proposed method consists in computing a sequence of automata representing approximations of the convex hull and using extrapolation techniques to compute the limit of this sequence. The convex hull can then be directly computed from this limit in the form of an automaton-based representation of the corresponding set of real vectors. The technique is quite general and has been implemented.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

BI-OBJECTIVE OPTIMIZATION OF RESERVOIR OPERATION BY MULTI-STEP PARALLEL CELLULAR AUTOMATA

Parallel Cellular Automata (PCA) previously has been employed for optimizing bi-objective reservoir operation, where one release is used to meet both objectives. However, if a single release can only be used for one objective, meaning two separate sets of releases are needed, the method is not applicable anymore. In this paper, Multi-Step Parallel Cellular Automata (MSPCA) has been developed fo...

متن کامل

Equational axioms associated with finite automata for fixed point operations in cartesian categories

The axioms of iteration theories, or iteration categories, capture the equational properties of fixed point operations in several computationally significant categories. Iteration categories may be axiomatized by the Conway identities and identities associated with finite automata. We show that the Conway identities and the identities associated with the members of a subclass Q of finite automa...

متن کامل

Constructing Semantic Automata for Quantifier Iterations

We expand on recent work extending the semantic automata model of quantifier verification to iteration. We demonstrate a simple and intuitive method to construct a minimal iteration DFA from two DFA recognizing monadic regular quantifier languages and prove that deterministic CFL are also closed under quantifier iteration. We also touch upon the relation between computational results and lingui...

متن کامل

Classification of Cellular Automata Rules Based on Their Properties

This paper presents a classification of Cellular Automata rules based on its properties at the nth iteration. Elaborate computer program has been designed to get the nth iteration for arbitrary 1-D or 2-D CA rules. Studies indicate that the figures at some particular iteration might be helpful for some specific application. The hardware circuit implementation can be done using opto-electronic c...

متن کامل

GAME OF COORDINATION FOR BACTERIAL PATTERN FORMATION: A FINITE AUTOMATA MODELLING

In this paper, we use game theory to describe the emergence of self-organization and consequent pattern formation through communicative cooperation in Bacillus subtilis colonies. The emergence of cooperative regime is modelled as an n-player Assurance game, with the bacterial colonies as individual players. The game is played iteratively through cooperative communication, and mediated by exchan...

متن کامل

Properties of Languages with Catenation and Shuffle

We present finite automata for shuffle languages, iteration lemmata for languages with catenation and shuffle, closure properties of such language classes, as well as decidability results.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009